P versus NP problem - PDFSEARCH.IO - Document Search Engine

P versus NP problem
Results: 202

#	Item
81	Measuring Rationality with the Minimum Cost of Revealed Preference Violations Mark Dean and Daniel Martin Online Appendices - Not for Publication Add to Reading List Source URL: www.econ.brown.edu Language: English - Date: 2013-06-19 07:39:31 Complexity classes NP-complete problems Mathematical optimization Structural complexity theory NP-complete NP-hard P versus NP problem NP Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
82	Draft – August 10, 2009. manuscript No. (will be inserted by the editor) A Computational Analysis of the Tournament Equilibrium Set Felix Brandt · Felix Fischer · Paul Harrenstein · Maximilian Mair Add to Reading List Source URL: dss.in.tum.de Language: English - Date: 2010-10-13 06:04:13 Mathematical optimization Transitive relation Transitivity Tournament Total order P versus NP problem Binary relation Mathematics Order theory Forcing
83	Questions Answered. In Theory. http://cstheory.stackexchange.com∗ Perhaps you’re a computer scientist wondering how much the Axiom of Choice matters to the theorems you study and prove[21]. Perhaps you’re a mathema Add to Reading List Source URL: www.cs.utah.edu Language: English - Date: 2010-11-05 18:41:12 Complexity classes Community websites Mathematical optimization Conjectures P versus NP problem Structural complexity theory Stack Exchange Network NP-complete NP Theoretical computer science Computational complexity theory Applied mathematics
84	P, N P and Mathematics – a computational complexity perspective Avi Wigderson “P versus N P – a gift to mathematics from Computer Science” Steve Smale. Add to Reading List Source URL: www.math.ias.edu Language: English - Date: 2006-03-15 13:50:29 Complexity classes Mathematical optimization Structural complexity theory Mathematical logic P NP-complete Decision problem Algorithm Time complexity Theoretical computer science Computational complexity theory Applied mathematics
85	A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA[removed] Add to Reading List Source URL: stuff.mit.edu Language: English - Date: 2009-05-25 23:54:59 Complexity classes Mathematical optimization Structural complexity theory Analysis of algorithms P versus NP problem NP-complete NP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
86	covering-revision-without-comments.dvi Add to Reading List Source URL: dss.in.tum.de Language: English - Date: 2013-01-24 06:29:17 Complexity classes NP-hard NP-complete P versus NP problem NP Polynomial hierarchy Polynomial P Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
87	Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states Fabio L. Traversa,1, 2, ∗ Chiara Ramella,2, † Fabrizio Bonani,2, ‡ and Massimiliano Di Ventra1, § arXiv:[removed] Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-12-03 20:27:51 Turing machine Models of computation Mathematical optimization Structural complexity theory Computational complexity theory NP P versus NP problem Reduction P-complete Theoretical computer science Applied mathematics Complexity classes
88	Review of1 of The P = NP Question and Godel’s Lost Letter by Richard J. Lipton Springer, [removed]pages, Hardcover Review by Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2010-10-04 09:51:41 Complexity classes NP-complete problems Mathematical optimization Conjectures P versus NP problem Structural complexity theory NP Integer factorization Richard J. Lipton Theoretical computer science Computational complexity theory Applied mathematics
89	Joint Review of1 Computational Complexity: A Conceptual Perspective by Oded Goldreich Published by Cambridge University Press, [removed]pages, Hardcover and Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2010-09-24 20:19:20 Complexity classes Probabilistic complexity theory Structural complexity theory Models of computation Pseudorandom generator Probabilistically checkable proof NP P versus NP problem Bounded-error probabilistic polynomial Theoretical computer science Computational complexity theory Applied mathematics
90	16th Canadian Conference on Computational Geometry, 2004 The Box Mover Problem Valentin Polishchuk Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Complexity classes Mathematical optimization Structural complexity theory NP-complete problems Sokoban NP-complete NP P versus NP problem Optimization problem Theoretical computer science Computational complexity theory Applied mathematics

UPDATE